A Problem Concerning a Character Sum

Bilinear Character Sums and Sum–product Problems on Elliptic Curves

Let E be an ordinary elliptic curve over a finite field Fq of q elements. We improve a bound on bilinear additive character sums over points on E, and obtain its analogue for bilinear multiplicative character sums. We apply these bounds to some variants of the sum–product problem on E.

On a Character Sum Problem of H. Cohn

Newton polygons for character sums and Poincaré series

In this paper, we precise the asymptotic behaviour of Newton polygons of L-functions associated to character sums, coming from certain n variable Laurent polynomials. In order to do this, we use the free sum on convex polytopes. This operation allows the determination of the limit of generic Newton polygons for the sum ∆ = ∆1 ⊕ ∆2 when we know the limit of generic Newton polygons for each facto...

Vehicle Routing Problem in Competitive Environment: Two-Person Nonzero Sum Game Approach

Vehicle routing problem is one of the most important issues in transportation. Among VRP problems, the competitive VRP is more important because there is a tough competition between distributors and retailers. In this study we introduced new method for VRP in competitive environment. In these methods Two-Person Nonzero Sum games are defined to choose equilibrium solution. Therefore, revenue giv...

A Robust Optimization Approach for a p-Hub Covering Problem with Production Facilities, Time Horizons and Transporter

Hub location-allocation problems are currently a subject of keen interest in the research community. However, when this issue is considered in practice, significant difficulties such as traffic, commodity transportation and telecommunication tend to be overlooked. In this paper, a novel robust mathematical model for a p-hub covering problem, which tackles the intrinsic uncertainty of some param...